Worst-Case Delay Bounds in Time-Sensitive Networks With Packet Replication and Elimination

Delay-sensitive packet scheduling in wireless networks

We consider “opportunistic” downlink scheduling of data traffic in a wireless network. In particular, we focus on the delay performance of such schedulers. First a channeldependent scheduling algorithm is considered which maximizes throughput by always transmitting to the user with the best channel conditions. The delay distribution of this scheduling rule is analyzed and asymptotic results are...

Worst-case delay bounds with fixed priorities using network calculus

Worst-case delay bounds are an important issue for applications with hard-time constraints. Network calculus is a useful theory to study worst-case performance bounds in networks. In this article, we focus on networks with a fixed priority service policy and provide methods to analyze systems where the traffic and the services are constrained by some minimum and/or maximum functions: arrival/se...

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds

In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on the update time. Low out-degree orientations turned out to be a surprisingly useful tool for managin...

Worst-Case Upper Bounds

There are many algorithms for testing satisfiability — how to evaluate and compare them? It is common (but still disputable) to identify the efficiency of an algorithm with its worst-case complexity. From this point of view, asymptotic upper bounds on the worst-case running time and space is a criterion for evaluation and comparison of algorithms. In this chapter we survey ideas and techniques ...

Refinement of worst-case execution time bounds by graph pruning